DEGREE SEQUENCES OF CACTIRAMACHANDRA RAO A.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 410-416; BIBL. 2 REF.Conference Paper

A CONSTRUCTION FOR A FAMILY OF SETS AND ITS APPLICATION TO MATROIDSDAWSON JE.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 136-147; BIBL. 6 REF.Conference Paper

THE HELLY-TYPE PROPERTY OF NON-TRIVIAL INTERVALS ON A TREESYSLO MM.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 297-298; BIBL. 3 REF.Article

CHARACTERISTICS OF CONSTRICTED JOSEPHSON TUNNELING JUNCTIONS FOR TREE DECODER USEYAMAUCHI Y; ISHIDA A.1982; TRANS. INST. ELECTRON. COMMUN. ENG. JPN, SECT. E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 2; PP. 102-106; BIBL. 6 REF.Article

ANTIDIRECTED SUBSTREES OF DIRECTED GRAPHSBURR SA.1982; CAN. MATH. BULL.; ISSN 0008-4395; CAN; DA. 1982; VOL. 25; NO 1; PP. 119-120; BIBL. 3 REF.Article

PARTITION NUMBERS FOR TREES AND ORDERED SETSJAMISON WALDNER RE.1981; PAC. J. MATH.; ISSN 0030-8730; USA; DA. 1981; VOL. 96; NO 1; PP. 115-140; BIBL. 18 REF.Article

COUNTEREXAMPLES TO RANDIC'S CONJECTURE ON DISTANCE DEGREE SEQUENCES FOR TREESSLATER PJ.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 1; PP. 89-92; BIBL. 3 REF.Article

UPPER AND LOWER BOUNDS ON THE COMPLEXITY OF THE MIN-CUT LINEAR ARRANGEMENT PROBLEM ON TREESLENGAUER T.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 1; PP. 99-113; BIBL. 11 REF.Article

ENUMERATION OF BINARY PHYLOGENETIC TREESFOULDS LR; ROBINSON RW.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 187-202; BIBL. 10 REF.Conference Paper

A METHOD OF GRADUAL GENERATING THE CO-TREES OF A LINEAR GRAPHMILITARU V.1981; REV. ROUM. PHYS.; ISSN 0035-4090; ROM; DA. 1981; VOL. 26; NO 1; PP. 3-6; ABS. FRE; BIBL. 6 REF.Article

DEQUES, TREES AND LATTICE PATHSROGERS DG; SHAPIRO LW.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 293-303; BIBL. 27 REF.Conference Paper

POLYHEDRA RELATED TO A LATTICEGRISHUHIN VP.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 1; PP. 70-89; BIBL. 12 REF.Article

RECOGNIZABLE FORMAL POWER SERIES ON TREESBERSTEL J; REUTENAUER C.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 2; PP. 115-148; BIBL. 27 REF.Article

BEST HUFFMAN TREESMARKOWSKY G.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 363-370; BIBL. 5 REF.Article

THEOREME DE REDUCTION POUR LES AUTOMATES SUR LES ARBRESNASYROV IR.1980; VEROJATN. METODY KIBERN.; SUN; DA. 1980; NO 17; PP. 79-87; BIBL. 6 REF.Article

LINEAR ALGORITHMS FOR FINDING THE JORDAN CENTER AND PATH CENTER OF A TREEHEDETNIEMI SM; COCKAYNE EJ; HEDETNIEMI ST et al.1981; TRANSP. SCI.; ISSN 0041-1655; USA; DA. 1981; VOL. 15; NO 2; PP. 98-114; BIBL. 14 REF.Article

MINIMUM COST SPANNING TREE GAMESGRANOT D; HUBERMAN G.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 1; PP. 1-18; BIBL. 10 REF.Article

NEIGHBOR FINDING TECHNIQUES FOR IMAGES REPRESENTED BY QUADTREESHANAN SAMET.1982; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1982; VOL. 18; NO 1; PP. 37-57; BIBL. 19 REF.Article

PARTITION EN CYCLES DU GRAPHE DE COMPARABILITE D'UN ARBREDARCEL N; ZIMMERMANN Y.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 1; PP. 53-64; BIBL. 5 REF.Article

ON THE DISTRIBUTION OF WINNING MOVES IN RANDOM GAME TREESFLANIGAN JA.1981; BULL. AUST. MATH. SOC.; ISSN 0004-9727; AUS; DA. 1981; VOL. 24; NO 2; PP. 227-237; BIBL. 7 REF.Article

TREEDIAGONAL MATRICES AND THEIR INVERSESKLEIN DJ.1982; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1982; VOL. 42; NO 1; PP. 109-117; BIBL. 7 REF.Article

ON THE STRUCTURE OF GENERAL STOCHASTIC AUTOMATADADUNA H.1981; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 4; PP. 287-302; ABS. FRE; BIBL. 11 REF.Article

UNE NOUVELLE DEMONSTRATION COMBINATOIRE DES FORMULES D'INVERSION DE LAGRANGELABELLE G.1981; ADV. MATH. (N.Y., 1965); ISSN 0001-8708; USA; DA. 1981; VOL. 42; NO 3; PP. 217-247; BIBL. 21 REF.Article

MAXIMUM WEALTH TREESHWANG FK.1980; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1980; VOL. 5; NO 4; PP. 487-493; BIBL. 3 REF.Article

HAMILTONIAN CYCLES IN THE CARTESIAN PRODUCT OF A TREE AND A CYCLEBATAGELJ V; PISANSKI T.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 2-3; PP. 311-312; BIBL. 6 REF.Article